#include"Btree.h"
#include"Queue.h"

int main()
{
	BTNode* n1 = BuyBTNode(1);
	BTNode* n2 = BuyBTNode(2);
	BTNode* n3 = BuyBTNode(3);
	BTNode* n4 = BuyBTNode(4);
	BTNode* n5 = BuyBTNode(5);
	BTNode* n6 = BuyBTNode(6);

	BTNode* n7 = BuyBTNode(7);
	n3->right = n7;

	n1->left = n2;
	n1->right = n4;
	n2->left = n3;
	n4->left = n5;
	n4->right = n6;

	//PreOrder(n1);
	printf("%d\n", TreeSize(n1));
	printf("%d\n", TreeHeight(n1));
	printf("%d\n", TreeLeafSize(n1));
	printf("%d\n", TreeKLevelSize(n1,3));


	LevelOrder(n1);
	return 0;
}